The Dynamic Family Assignment Heuristic

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The assignment heuristic for crossing reduction

Several applications use algorithms for drawing k-layered networks and, in particular, 2 layered ne tworks ( i . e . b ipart i t e graphs) . Bipartite graphs are commonly drawn in the plane so that all vertices lie on two parallel vertical lines, and an important requirement in drawing such graphs is to minimize edge crossings. Such a problem is NP-complete even when the position of the vertice...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

The Dynamic Assignment Problem

There has been considerable recent interest in the dynamic vehicle routing problem, but the complexities of this problem class have generally restricted research to myopic models. In this paper, we address the simpler dynamic assignment problem, where a resource (container, vehicle or driver) can only serve one task at a time. We propose a very general class of dynamic assignment models, and pr...

متن کامل

Heuristic task assignment for distributed computing systems

This paper addresses the problem of assigning a task with precedence constraint to a dist~buted computing system. The task turnaround time incIuding communication overhead and idle time is adopted to measure the performance of task assignment. The task assignment in this paper requires one to determine not only the assignment of modules, but also the sequence of message transmission to balance ...

متن کامل

Channel Assignment Optimisation Using an Adaptive Heuristic

The rapid development of mobile communications has caused a higher demand of radio channel or carrier frequency due to additional mobile subscribers. With a limited frequency bandwidth allocated to mobile operators, good network planning is important to avoid congestion in the network. Some of the methods used to improve congestion in mobile networks is cell splitting and frequency reuse, but w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2015

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2015.06.241